The Finite Fourier Transform of Classical Polynomials
نویسندگان
چکیده
The finite Fourier transform of a family of orthogonal polynomials is the usual transform of these polynomials extended by 0 outside their natural domain of orthogonality. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families. 2010 Mathematics subject classification: primary 33C45; secondary 44A38, 33C47, 33C10, 42C10.
منابع مشابه
Two Classes of Special Functions Using Fourier Transforms of Some Finite Classes of Classical Orthogonal Polynomials
Some orthogonal polynomial systems are mapped onto each other by the Fourier transform. The best-known example of this type is the Hermite functions, i.e., the Hermite polynomials multiplied by exp(−x2/2), which are eigenfunctions of the Fourier transform. In this paper, we introduce two new examples of finite systems of this type and obtain their orthogonality relations. We also estimate a com...
متن کاملThe Unified Method in Polygonal Domains via the Explicit Fourier Transform of Legendre Polynomials
The recent numerical implementation by Fornberg and collaborators of the so-called unified method to linear elliptic PDEs in polygonal domains involves the computation of the finite Fourier transform of the Legendre polynomials. A variation of this approach, introduced by two of the authors, also involves the same computation. Here, instead of expressing the finite Fourier transform of the Lege...
متن کاملDifference Macdonald - Mehta conjecture
with respect to the Gaussian measure. Macdonald extended it from An−1 to other root systems and verified his conjecture for classical ones by means of the Selberg integrals [M1]. It was established by Opdam in [O1] in full generality using the shift operators. The integral is an important normalization constant for a k-deformation of the Hankel transform introduced by Dunkl [D]. The generalized...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملA Method for Fast Computation of the Fourier Transform over a Finite Field
—We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.
متن کامل